Model Checking Logics for Communicating Sequential Agents

We present a model checking algorithm for LCSA, a temporal logic for communicating sequential agents (CSAs) introduced by Lodaya, Ramanujam, and Thiagarajan. LCSA contains temporal modalities indexed with a local point of view of one agent and allows to refer to properties of other agents according to the latest gossip which is related to local knowledge. The model checking procedure relies on a modularisation of LCSA into temporal and gossip modalities. We introduce a hierarchy of formulae and a corresponding hierarchy of equivalences, which allows to compute for each formula and nite state distributed system a nite multi modal Kripke structure, on which the formula can be checked with standard techniques.